Motion Planning for Continuous-Time Stochastic Processes: A Dynamic Programming Approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Programming Approach for Motion Planning with Arrival Requirements

Motion planning with predictable timing and velocity is crucial in certain tasks in multi-robot coordination, such as role assignment and formation positioning in robot soccer and autonomous intersection management. This paper introduces a dynamic programming algorithm that is polynomial-time in finding the set of feasible setpoint schedules for a mobile robot to reach a specific position on a ...

متن کامل

A Stochastic Programming Approach for a Multi-Site Supply Chain Planning in Textile and Apparel Industry under Demand Uncertainty

In this study, a new stochastic model is proposed to deal with a multi-product, multi-period, multi-stage, multi-site production and transportation supply chain planning problem under demand uncertainty. A two-stage stochastic linear programming approach is used to maximize the expected profit. Decisions such as the production amount, the inventory level of finished and semi-finished product, t...

متن کامل

Stochastic Processes in Continuous Time

1 Basic Concepts 3 1.1 Notions of equivalence of stochastic processes . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.2 Sample path properties . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Properties of filtrations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 1.4 Stopping times . . . . . . . . . . . . . . . . . ....

متن کامل

A dynamic programming approach for solving nonlinear knapsack problems

Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Automatic Control

سال: 2016

ISSN: 0018-9286,1558-2523

DOI: 10.1109/tac.2015.2500638